Hamiltonicity of 3 t EC Graphs with α = κ + 1
نویسندگان
چکیده
منابع مشابه
Hamiltonicity of 3-Arc Graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph G is defined to have vertices the arcs of G such that two arcs uv, xy are adjacent if and only if (v, u, x, y) is a 3-arc of G. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-...
متن کاملHamiltonicity in 3-domination-critical graphs with
Let 6. y, and x be respectively the minimum degree, the domination number and the independence number of a graph G. The graph G is 3-y-critical if y= 3 and the addition of any edge decreases y by 1. It was conjectured that any connected 3-;l-critical graph with 6 >2 is hamiltonian. In Fararon et al. (J. Graph Theory, 25 (1997) 173-184.) it was proved a,<6 + 2; and moreover, if x < 6 + 1, then G...
متن کاملOn hamiltonicity of P 3-dominated graphs
We introduce a new class of graphs which we call P3-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P3-dominated graph. We prove that G is hamiltonian if α(G) ≤ κ(G), with two exceptions: K2,3 and K1,1,3. We also prove that G is hamiltonian if G is 3-connected and |V (G)| ≤ 5δ(G) − 5. These results extend known re...
متن کاملHamiltonicity in 3-connected claw-free graphs
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimum degree δ ≥ ν+6 10 is Hamiltonian for ν sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order ν, and if δ(H) ≥ ν+5 10 , then either H is hamiltonian, or δ(H) = ν+5 10 and the Ryjác̆ek’s closure cl(H) of H is the line graph of a graph obtained...
متن کاملHamiltonicity of 3-connected line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectured [H. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Combin. Theory Ser. B 96 (2006) 571–576] that every 3-connected, essentially 4-connected line graph is Hamiltonian. In this note, we first show that the conjecture posed by Lai et al. is not tru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2021
ISSN: 2314-4785,2314-4629
DOI: 10.1155/2021/5523761